Brauer pairs of Camina p - groups of nilpotence class 2
نویسنده
چکیده
In this paper, we find a condition that characterizes when two Camina p-groups of nilpotence class 2 form a Brauer pair. MSC primary: 20C15
منابع مشابه
A note on finite semifields and certain p-groups of class 2
In this paper the authors discuss a relationship between ÿnite semiÿelds of characteristic p and certain ÿnite p-groups of nilpotence class 2.
متن کاملOn the existence of Johnson polynomials for p-groups
Let G be a finite p-group. We say that G has a Johnson polynomial if there exists a polynomial f(x) ∈ Q[x] and a character χ ∈ Irr(G) so that f(χ) equals the total character for G. In this paper, we show that if G has nilpotence class 2, then G has a Johnson polynomial if and only if Z(G) is cyclic, and we show that if |cd(G)| = 2, then G has a Johnson polynomial if and only if G has nilpotence...
متن کاملIsoclinic Classification of Some Pairs $(G,G\')$ of $p$-Groups
The equivalence relation isoclinism partitions the class of all pairs of groups into families. In this paper, a complete classification of the set of all pairs $(G,G')$ is established, whenever $G$ is a $p$-group of order at most $p^5$ and $p$ is a prime number greater than 3. Moreover, the classification of pairs $(H,H')$ for extra special $p$-groups $H$ is also given.
متن کاملOn the irreducible characters of Camina triples
The Camina triple condition is a generalization of the Camina condition in the theory of finite groups. The irreducible characters of Camina triples have been verified in the some special cases. In this paper, we consider a Camina triple (G,M,N) and determine the irreducible characters of G in terms of the irreducible characters of M and G/N.
متن کاملCHARACTER DEGREES AND NILPOTENCE CLASS OF FINITE p-GROUPS: AN APPROACH VIA PRO-p GROUPS
Let S be a finite set of powers of p containing 1. It is known that for some choices of S, if P is a finite p-group whose set of character degrees is S, then the nilpotence class of P is bounded by some integer that depends on S, while for some other choices of S such an integer does not exist. The sets of the first type are called class bounding sets. The problem of determining the class bound...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008